Evaluation of Map Projection Converting Algorithms.
نویسندگان
چکیده
منابع مشابه
A unified evaluation of iterative projection algorithms for phase retrieval
Iterative projection algorithms are successfully being used as a substitute of lenses to recombine, numerically rather than optically, light scattered by illuminated objects. Images obtained computationally allow aberration-free diffraction-limited imaging and the possibility of using radiation for which no lenses exist. The challenge of this imaging technique is transferred from the lenses to ...
متن کاملConverting Online Algorithms to Local Computation Algorithms
We give a general method for converting online algorithms to localcomputation algorithms, by selecting a random permutation of the input, andsimulating running the online algorithm. We bound the number of steps of thealgorithm using a query tree, which models the dependencies between queries.We improve previous analyses of query trees on graphs of bounded degree, andextend t...
متن کاملSymbolization of Map Projection Distortion: A Review
One of the most fundamental steps in map creation is the transformation of information from the surface of a globe onto a flat map. Mapmakers have developed and used hundreds of different map projections over the past 2,000 years, yet there is no perfect choice because every map projection uniquely alters some aspect of space during the transformation process. Detailed information about the typ...
متن کاملProjection algorithms with correction
We present in this paper two versions of a general correction procedure applied to a classical iterative method, which gives us the possibility, under certain assumptions, to obtain an extension of it to inconsistent linear least-squares problems. We prove that some well known extended projection type algorithms from image reconstruction in computerized tomography fit into one or the other of t...
متن کاملKernel Affine Projection Algorithms
The combination of the famed kernel trick and affine projection algorithms (APA) yields powerful nonlinear extensions, named collectively here KAPA. This paper is a follow-up study of the recently introduced kernel leastmean-square algorithm (KLMS). KAPA inherits the simplicity and online nature of KLMS while reducing its gradient noise, boosting performance. More interestingly, it provides a u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan society of photogrammetry and remote sensing
سال: 2000
ISSN: 0285-5844,1883-9061
DOI: 10.4287/jsprs.39.3_21